全文获取类型
收费全文 | 1096篇 |
免费 | 22篇 |
出版年
2021年 | 13篇 |
2020年 | 10篇 |
2019年 | 24篇 |
2018年 | 9篇 |
2017年 | 31篇 |
2016年 | 22篇 |
2015年 | 23篇 |
2014年 | 28篇 |
2013年 | 208篇 |
2012年 | 28篇 |
2011年 | 30篇 |
2010年 | 33篇 |
2009年 | 27篇 |
2008年 | 34篇 |
2007年 | 20篇 |
2006年 | 25篇 |
2005年 | 15篇 |
2004年 | 17篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 11篇 |
2000年 | 11篇 |
1998年 | 20篇 |
1997年 | 17篇 |
1993年 | 8篇 |
1991年 | 11篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1987年 | 8篇 |
1986年 | 32篇 |
1985年 | 24篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 14篇 |
1981年 | 20篇 |
1980年 | 22篇 |
1979年 | 20篇 |
1978年 | 18篇 |
1977年 | 12篇 |
1976年 | 17篇 |
1975年 | 16篇 |
1974年 | 14篇 |
1973年 | 10篇 |
1972年 | 24篇 |
1971年 | 15篇 |
1970年 | 14篇 |
1969年 | 15篇 |
1968年 | 13篇 |
1967年 | 11篇 |
1966年 | 10篇 |
排序方式: 共有1118条查询结果,搜索用时 31 毫秒
91.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
92.
93.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献
94.
Modern technology is producing high reliability products. Life testing for such products under normal use condition takes a lot of time to obtain a reasonable number of failures. In this situation a step‐stress procedure is preferred for accelerated life testing. In this paper we assume a Weibull and Lognormal model whose scale parameter depends upon the present level as well as the age at the entry in the present stress level. On the basis of that we propose a parametric model to the life distribution for step‐stress testing and suggest a suitable design to estimate the parameters involved in the model. A simulation study has been done by the proposed model based on maximum likelihood estimation. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
95.
Adam D. Bramoweth James Luther Barbara H. Hanusa Jon D. Walker Charles W. Atwood Jr. Anne Germain 《Defence and Peace Economics》2018,29(1):78-90
AbstractInsomnia is prevalent among Veterans with post-traumatic stress disorder (PTSD), it exacerbates PTSD symptoms, and it contributes to impaired functioning and quality of life. To improve treatment outcomes, it is important to identify risk factors for insomnia and sedative-hypnotic use. Classification and regression trees and logistic regression models were used to identify variables associated with insomnia or sedative-hypnotic use. Key findings include low insomnia diagnosis rates (3.5–5.6%) and high rates of sedative-hypnotics (44.2–49.0%). Younger Veterans and those without a breathing-related sleep disorder (BRSD) were more likely to receive an insomnia diagnosis. Veterans with greater service connection and those with an alcohol/substance use disorder were more likely to be prescribed sedative-hypnotics. Interaction terms may have identified potential groups at risk of being under-diagnosed with insomnia (i.e. non-black Veterans with psychiatric co-morbidity, black Veterans without psychiatric co-morbidity) as well as groups at risk for sedative-hypnotic use (i.e. younger Veterans without BRSD). In sum, Veterans with PTSD have high rates of sedative-hypnotic use despite minimal evidence they are effective. This is counter to recommendations indicating behavioral interventions are the first-line treatment. Policy changes are needed to reduce use of sedative-hypnotics and increase access to behavioral insomnia interventions. 相似文献
96.
D J L Moore 《Whitehall Papers》2013,80(1):13-22
Abstract David Moore analyses the role of the Treasury in detemining and controlling defence policy and expenditure, and the place of the MoD within this function. 相似文献
97.
98.
影响图建模算法的改进 总被引:1,自引:0,他引:1
影响图建模方法是一种规范化的复杂系统建模方法,其实质是将表征复杂系统的参量及参量间的耦合关系进行分类,并以此为基础建立系统的数学模型.影响图建模算法就是将系统的参量及参量间的耦合关系进行分类的算法.目前使用的算法是James R.Burns于1979年提出的.该算法仅考虑了最小的反馈回路,而没有考虑影响图中存在的一般反馈回路,且一些操作造成了不必要的循环.在分析该算法的基础上,考虑了一般的反馈回路,并对原算法的操作步骤进行了优化重组. 相似文献
99.
Peter J. Phillips 《Defense & Security Analysis》2010,26(3):261-272
The purpose of this article is to explore the economic theoretical foundations of the idea that rational terrorist organizations deliberately randomize their attacks (by type, timing, location, and targets) to generate uncertainty and intimidation. A choice theoretic framework is applied to the analysis of the terrorist organization's behavior to determine whether welfare (utility) gains from the randomization of terrorist attacks are plausible and feasible. The randomization of attacks can appear to promise higher amounts of political influence for each resource input but it turns out that randomization cannot manufacture a situation where higher amounts of political influence are obtained for each resource input.The results imply that, rather than randomization and instability, the rational terrorist organization is more likely to prefer stability. The findings and implications provide a theoretical explanation for the non-randomness of terrorist attacks.Thismay be one small step towards explaining the patterns – non-randomness – in the time-series of terrorist incidents. 相似文献
100.